Execution Time – Area Tradeoff in Gausing Residual Load Decoder: Integrated Exploration of Chaining Based Schedule and Allocation in Hls for Hardware Accelerators

نویسندگان

  • Anirban Sengupta
  • Reza Sedaghat
  • Vipul Kumar Mishra
چکیده

Design space exploration is an indispensable segment of High Level Synthesis (HLS) design of hardware accelerators. This paper presents a novel technique for Area-Execution time tradeoff using residual load decoding heuristics in genetic algorithms (GA) for integrated design space exploration (DSE) of scheduling and allocation. This approach is also able to resolve issues encountered during DSE of data paths for hardware accelerators, such as accuracy of the solution found, as well as the total exploration time during the process. The integrated solution found by the proposed approach satisfies the user specified constraints of hardware area and total execution time (not just latency), while at the same time offers a twofold unified solution of chaining based schedule and allocation. The cost function proposed in the genetic algorithm approach takes into account the functional units, multiplexers and demultiplexers needed during implementation. The proposed exploration system (ExpSys) was tested on a large number of benchmarks drawn from the literature for assessment of its efficiency. Results indicate an average improvement in Quality of Results (QoR) greater than 26 % when compared to a recent well known GA based exploration method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low Cost Security Aware High Level Synthesis Methodology

Owing to massive complexity of modern digital integrated circuits (ICs) disabling complete inhouse development, globalization of the design process establishes itself as an inevitable solution for faster and efficient design. However, globalization incurs importing intellectual property (IP) cores from various third party (3P) vendors, rendering an IP susceptible to hardware threats. To provide...

متن کامل

Features A Methodology for Comprehensive Schedule Delay Estimation during Design space Exploration in Architectural Synthesis

This letter presents a novel improved delay estimation methodology during scheduling in high level synthesis (HLS) for application specific computing. In general during delay estimation from scheduling during HLS, only functional unit delay is considered. However for current generation of complex digital systems, interconnects (switching elements) also play a very vital role in effective delay ...

متن کامل

MAMPSx: A Design Methodology for Rapid System-Level Exploration, Synthesis of Heterogeneous SoC on FPGA

To achieve better performance and to meet time-to-market demands, heterogeneous reconfigurable MPSoCs like Xilinx Zynq platform are fast becoming popular. However, there are very limited design tools that enable both programming of applications and the exploration of the design space of these applications on the heterogeneous platforms. Also these existing tools are time consuming and require e...

متن کامل

An efficient CAD tool for High-Level Synthesis of VLSI digital transformers

Digital transformers are considered as one of the digital circuits being widely used in signal and data processing systems, audio and video processing, medical signal processing as well as telecommunication systems. Transforms such as Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Fast Fourier Transform (FFT) are among the ones being commonly used in this area. As an illu...

متن کامل

Automated exploration of datapath and unrolling factor during power-performance tradeoff in architectural synthesis using multi-dimensional PSO algorithm

A novel algorithm for automated simultaneous exploration of datapath and Unrolling Factor (UF) during power–performance tradeoff in High Level Synthesis (HLS) using multi-dimensional particle swarm optimization (PSO) (termed as ‘M-PSO’) for control and data flow graphs (CDFGs) is presented. The major contributions of the proposed algorithm are as follows: (a) simultaneous exploration of datapat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014